Optimal Tolling for Multitype Mixed Autonomous Traffic Networks

When selfish users share a road network and minimize their individual travel costs, the equilibrium they reach can be worse than socially optimal routing. Tolls are often used to mitigate this effect in traditional congestion games, where all vehicles contribute identically congestion. However, with proliferation of autonomous driver-assistance technology, become heterogeneous how latency. This magnifies potential inefficiencies due routing invalidates tolling methods. To address this, we consider parallel roads latency on each is an affine function quantity flow vehicle type. We provide tolls (which differentiate between types) which guaranteed social cost at equilibrium. The calculated routing; enable tolling, prove that some element set routings has lack cycles graph representing way types roads. then show unless planner given, resulting unboundedly routing, marginal fails our setting.